runtime.timers.heap (field)

51 uses

	runtime (current package)
		proc.go#L6016: 		if len(pp.timers.heap) > 0 {
		proc.go#L6359: 			print(" runqsize=", t-h, " gfreecnt=", pp.gFree.n, " timerslen=", len(pp.timers.heap), "\n")
		time.go#L106: 	heap []timerWhen
		time.go#L147: 	ts.len.Store(uint32(len(ts.heap)))
		time.go#L244: 	if ts == nil || t != ts.heap[0].timer {
		time.go#L259: 		ts.heap[0].when = t.when
		time.go#L389: 	ts.heap = append(ts.heap, timerWhen{t, t.when})
		time.go#L390: 	ts.siftUp(len(ts.heap) - 1)
		time.go#L391: 	if t == ts.heap[0].timer {
		time.go#L474: 	t := ts.heap[0].timer
		time.go#L479: 	last := len(ts.heap) - 1
		time.go#L481: 		ts.heap[0] = ts.heap[last]
		time.go#L483: 	ts.heap[last] = timerWhen{}
		time.go#L484: 	ts.heap = ts.heap[:last]
		time.go#L661: 		if len(ts.heap) == 0 {
		time.go#L677: 		n := len(ts.heap)
		time.go#L678: 		if t := ts.heap[n-1].timer; t.astate.Load()&timerZombie != 0 {
		time.go#L684: 				ts.heap[n-1] = timerWhen{}
		time.go#L685: 				ts.heap = ts.heap[:n-1]
		time.go#L691: 		t := ts.heap[0].timer
		time.go#L719: 	if len(src.heap) > 0 {
		time.go#L723: 		for _, tw := range src.heap {
		time.go#L733: 		src.heap = nil
		time.go#L738: 		ts.len.Store(uint32(len(ts.heap)))
		time.go#L819: 	for i := 0; i < len(ts.heap); i++ {
		time.go#L820: 		tw := &ts.heap[i]
		time.go#L839: 			n := len(ts.heap)
		time.go#L840: 			ts.heap[i] = ts.heap[n-1]
		time.go#L841: 			ts.heap[n-1] = timerWhen{}
		time.go#L842: 			ts.heap = ts.heap[:n-1]
		time.go#L924: 	if len(ts.heap) > 0 {
		time.go#L926: 		for len(ts.heap) > 0 {
		time.go#L964: 	if len(ts.heap) == 0 {
		time.go#L967: 	tw := ts.heap[0]
		time.go#L1130: 	for i, tw := range ts.heap {
		time.go#L1138: 		if tw.when < ts.heap[p].when {
		time.go#L1139: 			print("bad timer heap at ", i, ": ", p, ": ", ts.heap[p].when, ", ", i, ": ", tw.when, "\n")
		time.go#L1143: 	if n := int(ts.len.Load()); len(ts.heap) != n {
		time.go#L1144: 		println("timer heap len", len(ts.heap), "!= atomic len", n)
		time.go#L1153: 	if len(ts.heap) == 0 {
		time.go#L1156: 		ts.minWhenHeap.Store(ts.heap[0].when)
		time.go#L1211: 	heap := ts.heap
		time.go#L1236: 	heap := ts.heap
		time.go#L1278: 	if len(ts.heap) <= 1 {
		time.go#L1281: 	for i := int(uint(len(ts.heap)-1-1) / timerHeapN); i >= 0; i-- {